Statistical Mechanics of the Minimum Dominating Set Problem
نویسندگان
چکیده
منابع مشابه
Statistical Mechanics of the Minimum Dominating Set Problem
The minimum dominating set problem has wide applications in network science and related fields. It consists of assembling a node set of global minimum size such that any node of the network is either in this set or is adjacent to at least one node of this set. Although this is a difficult optimization problem in general, we show it can be exactly solved by a generalized leaf-removal process if ...
متن کاملSimple Bounds for the Minimum Dominating Trail Set problem
Given a graph G, the Minimum Dominating Trail Set (MDTS) problem consists in ̄nding a minimum cardinality collection of pairwise edge-disjoint trails such that each edge of G has at least one endvertex on some trail. The MDTS problem is NP{hard for general graphs. In this paper lower and upper bounds for the MDTS problem on general graphs are presented.
متن کاملAnt Colony Optimization Applied to Minimum Weight Dominating Set Problem
In this paper we present an application of ant colony optimization (ACO) to the Minimum Weighted Dominating Set Problem. We introduce a heuristic for this problem that takes into account the weights of vertexes being covered and show that it is more efficient than the greedy algorithm using the standard heuristic. Further we give implementation details of ACO applied to this problem. We tested ...
متن کاملOn minimum connected dominating set problem in unit-ball graphs
Given a graph, the minimum connected dominating set problem is to find a minimum cardinality subset of vertices D such that its induced subgraph is connected and each vertex outside D has at least one neighbor in D. Approximations of minimum connected dominating sets are often used to represent a virtual routing backbone in wireless networks. This paper proposes a constant-ratio approximation a...
متن کاملAlgorithms for Minimum m -Connected k -Dominating Set Problem
In wireless sensor networks, virtual backbone has been proposed as the routing infrastructure to alleviate the broadcasting storm problem and perform some other tasks such as area monitoring. Previous work in this area has mainly focused on how to set up a small virtual backbone for high efficiency, which is modelled as the minimum Connected Dominating Set (CDS) problem. In this paper we consid...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Statistical Physics
سال: 2015
ISSN: 0022-4715,1572-9613
DOI: 10.1007/s10955-015-1220-2